Adaptable Colouring of Graph Products
نویسندگان
چکیده
A colouring of the vertices of a graph (or hypergraph) G is adapted to a given colouring of the edges of G if no edge has the same colour as both (or all) its vertices. The adaptable chromatic number of G is the smallest integer k such that each edge-colouring of G by colours 1, 2, . . . , k admits an adapted vertex-colouring of G by the same colours 1, 2, . . . , k. (The adaptable chromatic number is just one more than a previously investigated notion of chromatic capacity.) The adaptable chromatic number of a graph G is smaller than or equal to the ordinary chromatic number of G. While the ordinary chromatic number of all powers G of G remains the same as that of G, the adaptable chromatic number of G may increase with k. We conjecture that for all sufficiently large k the adaptable chromatic number of G equals the chromatic number of G. When G is complete, we prove this conjecture with k ! 4, and offer additional evidence suggesting it may hold with k ! 2. We also discuss other products and propose several open problems.
منابع مشابه
The Adaptable Chromatic Number and the Chromatic Number
We prove that the adaptable chromatic number of a graph is at least asymptotic to the square root of the chromatic number. This is best possible. Consider a graph G where each edge of G is assigned a colour from {1, ..., k} (this is not necessarily a proper edge colouring). A k-adapted colouring is an assignment of colours from {1, ..., k} to the vertices of G such that there is no edge with th...
متن کاملAn upper bound on adaptable choosability of graphs
Given a (possibly improper) edge-colouring F of a graph G, a vertex colouring c of G is adapted to F if no colour appears at the same time on an edge and on its two endpoints. If for some integer k, a graph G is such that given any list assignment L of G, with |L(v)| ≥ k for all v, and any edge-colouring F of G, there exists a vertex colouring c of G adapted to F such that c(v) ∈ L(v) for all v...
متن کاملAdaptable choosability of planar graphs with sparse short cycles
Given a (possibly improper) edge-colouring F of a graph G, a vertex colouring of G is adapted to F if no colour appears at the same time on an edge and on its two endpoints. A graph G is called adaptably k-choosable (for some positive integer k) if for any list assignment L to the vertices of G, with |L(v)| ≥ k for all v, and any edge-colouring F of G, G admits a colouring c adapted to F where ...
متن کاملOn the adaptable chromatic number of graphs
The adaptable chromatic number of a graph G is the smallest integer k such that for any edge k-colouring of G there exists a vertex kcolouring of G in which the same colour never appears on an edge and both its endpoints. (Neither the edge nor the vertex colourings are necessarily proper in the usual sense.) We give an efficient characterization of graphs with adaptable chromatic number at most...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008